Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory
نویسندگان
چکیده
RULE REDUCTS BASED ON ROUGH SET THEORY Şahin Emrah AMRAHOV Computer Engineering Department , Ankara University, Ankara, Turkey Fatih AYBAR Computer Engineering Department, Ankara University, Ankara, Turkey Serhat DOĞAN Economics Department, Bilkent University, Ankara, Turkey In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms are well-known. Alternative to these algorithms Pruning Algorithm of Generation A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation (PRG) algorithm is developed. PRG algorithm uses tree structured data type. PRG algorithm is compared with RG and MRG algorithms.
منابع مشابه
Reducts and Rough Set Analysis
Rough set theory offers a mathematical approach to data analysis and data mining. It can be used to learn classification rules that define classes of a classification based on some well defined concepts. The fundamental task of rough set data analysis is to precisely construct and interpret concepts. When applying rough set theory to rule learning, the main tasks involve removing redundant attr...
متن کاملEvaluation of Rough Set Theory for Decision Making of rehabilitation Method for Concrete Pavement
In recent years a great number of advanced theoretical - empirical methods has been developed for design & modeling concrete pavements distress. But there is no reliable theoretical method to be use in evaluation of conerete pavements distresses and making a decision about repairing them. Only empirical methods is used for this reason. One of the most usual methods in evaluating concrete paveme...
متن کاملAn Evaluation Method of Relative Reducts Based on Roughness of Partitions
This paper focuses on rough set theory which provides mathematical foundations of set-theoretical approximation for concepts, as well as reasoning about data. Also presented in this paper is the concept of relative reducts which is one of the most important notions for rule generation based on rough set theory. In this paper, from the viewpoint of approximation, the authors introduce an evaluat...
متن کاملHighly Scalable Rough Set Reducts Generation
Rough set theory is used to represent, analyze, and manipulate knowledge in information or decision tables. To remove superfluous attributes without changing the original knowledge, reduction is must in rough set. This paper introduces the pseudo decision table to replace the original table and two algorithms, RGonCRS and SRGonCRS, based on the current rules size, CRS, are presented to generate...
متن کاملTowards Scalable Algorithms for Discovering Rough Set Reducts
Rough set theory allows one to find reducts from a decision table, which are minimal sets of attributes preserving the required quality of classification. In this article, we propose a number of algorithms for discovering all generalized reducts (preserving generalized decisions), all possible reducts (preserving upper approximations) and certain reducts (preserving lower approximations). The n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1011.0190 شماره
صفحات -
تاریخ انتشار 2010